Multiple serial episodes matching

Multiple serial episode matching

In [BCGM01] we have generalized the Knuth-Morris-Pratt (KMP) pattern matching algorithm and defined a nonconventional kind of RAM, the MP–RAMs which model more closely the microprocessor operations, and designed an O(n) on-line algorithm for solving the serial episode matching problem on MP–RAMs when there is only one single episode. We here give two extensions of this algorithm to the case whe...

Extracting Trees of Quantitative Serial Episodes

Among the family of the local patterns, episodes are commonly used when mining a single or multiple sequences of discrete events. An episode reflects a qualitative relation is-followed-by over event types, and the refinement of episodes to incorporate quantitative temporal information is still an on going research, with many application opportunities. In this paper, focusing on serial episodes,...

Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database

Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive and fixed-time intervals in a sequence. Previous studies on serial episodes consider only frequent serial episodes in a sequence of events (called simple sequence). In real world, we may find a set of events at each t...

Summarising Event Sequences using Serial Episodes and an Ontology

The ideal result in pattern mining is a small set of patterns that identify the key structure of the data. In this paper we propose NemO, an e cient method for summarising discrete sequences in terms sequential patterns over an ontology. That is, NemO can detect patterns between not only the surface level, but also between the categories the events in the data are part of, and returns a small s...

Parallel and Serial Methods of Pattern Matching